Subexponential Asymptotics of the Stationary Distributions of GI/G/1-Type Markov Chains
نویسندگان
چکیده
2 This paper considers the subexponential asymptotics of the stationary distributions of GI/G/1-type Markov chains in two cases: (i) the phase transition matrix in non-boundary levels is stochastic; and (ii) it is strictly substochastic. For the case (i), we present a weaker sufficient condition for the subexponential asymptotics than those given in the literature. As for the case (ii), the subexponential asymptotics has not been studied, as far as we know. We show that the subexponential asymptotics in the case (ii) is different from that in the case (i). We also study the locally subexponential asymptotics of the stationary distributions in both cases (i) and (ii).
منابع مشابه
Subexponential asymptotics of the stationary distributions of M/G/1-type Markov chains
This paper studies the subexponential asymptotics of the stationary distribution of an M/G/1-type Markov chain. We provide a sufficient condition for the subexponentiality of the stationary distribution. The sufficient condition requires only the subexponential integrated tail of level increments. On the other hand, the previous studies assume the subexponentiality of level increments themselve...
متن کاملLogarithmic Asymptotics for the GI/G/1-type Markov Chains and their Applications to the BMAP/G/1 Queue with Vacations
We study tail asymptotics of the stationary distribution for the GI=G=1-type Markov chain with finitely many background states. Decay rate in the logarithmic sense is identified under a number of conditions on the transition probabilities. The results are applied to the BMAP=G=1 queuewith vacations. The relationship between vacation time and the decay rate of the queue length distribution is in...
متن کاملHeavy-traffic asymptotics for stationary GI/G/1-type Markov chains
Asmussen (1987) proved a heavy-traffic limit theorem for the GI/G/1-type Markov chain. As a corollary, the theorem shows that in the heavy-traffic limit, the stationary distribution of the properly scaled level variable is geometric and independent of the phase variable. In this paper, the heavy-traffic asymptotics of the stationary distribution is proved under a weaker condition than Asmussen’...
متن کاملAsymptotics for Steady-state Tail Probabilities in Structured Markov Queueing Models
In this paper we establish asymptotics for the basic steady-state distributions in a large class of single-server queues. We consider the waiting time, the workload (virtual waiting time) and the steady-state queue lengths at an arbitrary time, just before an arrival and just after a departure. We start by establishing asymptotics for steady-state distributions of Markov chains of M/GI/1 type. ...
متن کاملHeavy Tails in Multi-Server Queue
In this paper, the asymptotic behaviour of the distribution tail of the stationary waiting time W in the GI/GI/2 FCFS queue is studied. Under subexponential-type assumptions on the service time distribution, bounds and sharp asymptotics are given for the probability P{W > x}. We also get asymptotics for the distribution tail of a stationary two-dimensional workload vector and of a stationary qu...
متن کامل